package 题目集.bfs;

//todo
import java.util.*;

public class 青蛙跳 {
    static int[] target;
    static int[] start;
    static int tHash;

    static int[] dirs = {1, -1, 2, -2, 3, -3};

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String e = sc.nextLine();
        start = new int[s.length()];
        target = new int[e.length()];
        Map<Integer,int[]> vis = new HashMap<>();
        Queue<Integer> queue = new ArrayDeque<>(start.length);
        for (int i = 0; i < s.length(); i++) {
            start[i] = s.charAt(i);
            target[i] = e.charAt(i);
            if (start[i] == '*') {
                queue.add(i);
            }
        }
        tHash = Arrays.hashCode(target);
        int step = 0;

    }
}
